Cost-sensitive label embedding for multi-label classification
نویسندگان
چکیده
منابع مشابه
Condensed Filter Tree for Cost-Sensitive Multi-Label Classification
Proof. The proof is similar to the one in (Beygelzimer et al., 2008), which is based on defining the overallregret of any subtree. The key change in our proof is to define the path-regret of any subtree to be the total regret of the nodes on the ideal path of the subtree. The induction step follows similarly from the proof in (Beygelzimer et al., 2008) by considering two cases: one for the idea...
متن کاملMulti-Task Label Embedding for Text Classification
Multi-task learning in text classification leverages implicit correlations among related tasks to extract common features and yield performance gains. However, most previous works treat labels of each task as independent and meaningless onehot vectors, which cause a loss of potential information and makes it difficult for these models to jointly learn three or more tasks. In this paper, we prop...
متن کاملDynamic Principal Projection for Cost-Sensitive Online Multi-Label Classification
We study multi-label classification (MLC) with three important real-world issues: online updating, label space dimensional reduction (LSDR), and cost-sensitivity. Current MLC algorithms have not been designed to address these three issues simultaneously. In this paper, we propose a novel algorithm, cost-sensitive dynamic principal projection (CS-DPP) that resolves all three issues. The foundati...
متن کاملCondensed Filter Tree for Cost-Sensitive Multi-Label Classification
Proof. The proof is similar to the one in (Beygelzimer et al., 2008), which is based on defining the overall-regret of any subtree. The key change in our proof is to define the path-regret of any subtree to be the total regret of the nodes on the ideal path of the subtree. The induction step follows similarly from the proof in (Beygelzimer et al., 2008) by considering two cases: one for the ide...
متن کاملCost-sensitive Encoding for Label Space Dimension Reduction Algorithms on Multi-label Classification
Multi-label classification (MLC) extends multi-class classification by tagging each instance as multiple classes simultaneously. Different real-world MLC applications often demand different evaluation criteria (costs), which calls for cost-sensitive MLC (CSMLC) algorithms that can easily take the criterion of interest into account. Nevertheless, existing CSMLC algorithms generally suffer from h...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Machine Learning
سال: 2017
ISSN: 0885-6125,1573-0565
DOI: 10.1007/s10994-017-5659-z